FLAT_U1L1_Introduction to FLAT.m4v
FLAT_U1L2 - Basics of Formal Languages_140820 Part-1
FLAT_U1L2 - Basics of Formal Languages_140820 Part-2
FLAT_U1L3_Grammars and Derivation_Presentation
FLAT_U1L4_Types of Grammar and Chomsky Hierarchy
FLAT_U1L5_Deterministic Finite Automata_Presentation
FLAT_U1L6_Non-deterministic Finite Automata_Presentation
FLAT_U1L7_e-NFA to DFA Conversion_Presentation
FLAT_U1L8_NFA to DFA Conversion_Presentation
FLAT_U1L9_Regular Expression_Presentation
FLAT_U1L10_Regular Expression and Automata_Presentation
FLAT_U1L11_DFA to RE and RE to e-NFA
FLAT_U1L12_Pumping Lemma for RL
FLAT_U1L13_Closure properties of RL
FLAT_U1L14_DFA Minimization Part 2
FLAT_U1L14_DFA Minimization Presentation
FLAT_U2L1_Introduction to CFL
FLAT_U2L2_Types of Derivation and Parse Tree
FLAT_U2L3_Ambiguity in Grammars & Languages
FLAT_U2L4_Push Down Automata
FLAT_U2L5_PDA Examples
FLAT_U2L6_ Equivalence of PDA and CFG Part 1.m4v
FLAT_U2L6_Equivalence of PDA and CFG Examples.m4v
FLAT_U2L7_Deterministic PDA
FLAT_U2L8_Chomsky Normal Form
FLAT_U2L9_Greibach Normal Form
FLAT_U2L10_Pumping Lemma for CFL
FLAT_U3L1_Context-Sensitive Language and LBA
FLAT_U3L2_Intorduction to Turing Machine
FLAT_U3L3_Designing Turing Machine
FLAT_U3L4_Designing Turing Machines Part 2
FLAT_U3L5_Programming Techniques for TM
FLAT_U3L6_Extended and Restricted TMs
FLAT_U3_Revision Part1
FLAT_U3L7_Turing recognizable and Turing decidable languages
FLAT_U3L8_Variants of Turing machine
FLAT_U3L9_Non Deterministic Turing Machine
FLAT_U3L10_TM as Enumerator
FLAT_U4L1_Undecidability
FLAT_U4L2_Diagonalization and A Language which is not Recursively Enumberable
FLAT_U4L3_Universal Language and Universal TM
FLAT_U4L4_Reducibility and Rice Theorem
FLAT_U4L5_Other Models Computation
FLAT_U4L6_Post Correspondence Problem
FLAT_U4L7_Computational Complexity
FLAT_U4L8_Intractable problems-P and NP class
FLAT_U4L9_NP Completeness
FLAT_U4_Revision Part 1
FLAT_U1_Revision 1
FLAT_U1_Revision Part 2
FLAT_U2_Revision
FLAT_U4 and Overall Revision_Feedback
